Generalized Arc-Sets
نویسندگان
چکیده
منابع مشابه
Arc-Disjoint Cycles and Feedback Arc Sets
Isaak posed the following problem. Suppose T is a tournament having a minimum feedback arc set which induces an acyclic digraph with a hamiltonian path. Is it true that the maximum number of arc-disjoint cycles in T equals the cardinality of minimum feedback arc set of T? We prove that the answer to the problem is in the negative. Further, we study the number of arc-disjoint cycles through a ve...
متن کاملExtending Generalized Arc Consistency
Generalized arc consistency (GAC) is the most widely used local consistency in constraint programming. Several GAC algorithms for specific constraints, as well as generic algorithms that can be used on any constraint, have been proposed in the literature. Stronger local consistencies than GAC have also been studied but algorithms for such consistencies are generally considered too expensive. In...
متن کاملSome points on generalized open sets
The paper is an attempt to represent a study of limit points, boundary points, exterior points, border, interior points and closure points in the common generalized topological space. This paper takes a look at the possibilities of an extended topological space and it also considers the new characterizations of dense set.
متن کاملTournaments as Feedback Arc Sets
We examine the size s(n) of a smallest tournament having the arcs of an acyclic tournament on n vertices as a minimum feedback arc set. Using an integer linear programming formulation we obtain lower bounds s(n) ≥ 3n − 2 − blog2 nc or s(n) ≥ 3n − 1 − blog2 nc, depending on the binary expansion of n. When n = 2k − 2t we show that the bounds are tight with s(n) = 3n−2−blog2 nc. One view of this p...
متن کاملMinimum Feedback Arc Sets in Rotator Graphs
A feedback vertex set/arc set (abbreviated to FVS/FAS) is a vertex/arc subset of a graph whose removal induces the remaining graph acyclic. A minimum FVS/FAS is an FVS/FAS which contains the smallest number of vertices/arcs. Hsu and Lin [8] first proposed an algorithm which can find a minimum FVS in rotator graphs. In this paper, we present two efficient algorithms both of which construct FAS’s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences
سال: 1945
ISSN: 0027-8424,1091-6490
DOI: 10.1073/pnas.31.12.414